Super-linear convergence in the p-adic QR-algorithm
نویسندگان
چکیده
The QR-algorithm is one of the most important algorithms in linear algebra. Its several variants make feasible computation eigenvalues and eigenvectors a numerical real or complex matrix, even when dimensions matrix are enormous. first adaptation to local fields was given by author 2019. However, this version rate convergence only some cases decomposition into invariant subspaces incomplete. We present refinement algorithm with super-linear many cases.
منابع مشابه
Linear Convergence in the Shifted Qr Algorithm
Global and asymptotic convergence properties for the QR algorithm with Francis double shift are established for certain orthogonal similarity classes of 4 x 4 real matrices. It is shown that in each of the classes every unreduced Hessenberg matrix will decouple and that the rate of decoupling is almost always linear. The effect of the EISPACK exceptional shift strategy is shown to be negligible.
متن کاملGlobal Convergence of the Basic QR Algorithm
0. Introduction. The QR algorithm was developed by Francis (1960) to find the eigenvalues (or roots) of real or complex matrices. We shall consider it here in the context of exact arithmetic. Sufficient conditions for convergence, listed in order of increasing generality have been given by Francis [1], Kublanovskaja [3], Parlett [4], and Wilkinson [8]. It seems that necessary and sufficient con...
متن کاملSUPER-APPROXIMATION: p-ADIC SEMISIMPLE CASE
Let k be a number field, Ω be a finite symmetric subset of GLn0 (k), and Γ = 〈Ω〉. Let C(Γ) := {p ∈ Vf (k)| Γ is a bounded subgroup of GLn0 (kp)}, and Γp be the closure of Γ in GLn0 (kp). Assuming that the Zariski-closure of Γ is semisimple, we prove that the family of left translation actions {Γ y Γp}p∈C(Γ) has uniform spectral gap. As a corollary we get that the left translation action Γ y G h...
متن کاملConvergence of the shifted QR algorithm for unitary Hessenberg matrices
This paper shows that for unitary Hessenberg matrices the QR algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with glob...
متن کاملGlobal Convergence of the Basic QR Algorithm on Hessenberg Matrices*
0. Introduction. The QR algorithm was developed by Francis (1960) to find the eigenvalues (or roots) of real or complex matrices. We shall consider it here in the context of exact arithmetic. Sufficient conditions for convergence, listed in order of increasing generality have been given by Francis [1], Kublanovskaja [3], Parlett [4], and Wilkinson [8]. It seems that necessary and sufficient con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear & Multilinear Algebra
سال: 2021
ISSN: ['0308-1087', '1026-7573', '1563-5139']
DOI: https://doi.org/10.1080/03081087.2021.2011089